α-Generalized Semantic Resolution Method in Linguistic Truth-valued Propositional LogicLV(n×2)P(X)
نویسندگان
چکیده
منابع مشابه
α-Resolution Method for Lattice-valued Horn Generalized Clauses in Lattice-valued Propositional Logic Systems
In this paper, an α-resolution method for a set of lattice-valued Horn generalized clauses is established in lattice-valued propositional logic systemL P(X) based on lattice implication algebra. Firstly, the notions of lattice-valued Horn generalized clause, normal lattice-valued Horn generalized clause and unit latticevalued Horn generalized clause are given in L P(X). Then, the α-resolution o...
متن کاملResolution Method in Linguistic Propositional Logic
In the present paper, the resolution method for a linguistic propositional logic with truth value in a logical algebra refined hedge algebra, is focused. The preliminaries of refined hedge algebra are given first. Then the syntax and semantic of linguistic propositional are defined. Finally, a resolution method which based on resolution principle in two-valued logic is established. Accordingly,...
متن کاملDouble-layer Modificatory Linguistic Truth-value Lattice-valued Evaluation Method
In this paper, a double-layer modificatory linguistic truth-value lattice-valued evaluation method is presented. Its logic basic is based on modificatory linguistic truth-value lattice-valued proposition logic system MLTVLP(X) and operator modificatory linguistic truth-value lattice-valued proposition logic OMLTVLP(X). MLTVLP(X) and OMLTVLP(X) are similar to LTVLP(X) and MLTVLP(X), which have b...
متن کاملA Resolution Method for Linguistic Many-valued Logic
This paper studies the linguistic truth value domain (AX) based on finite monotonous hedge algebra and then we extend lukasiewicz algebra on [0, 1] to linguistic lukasiewicz algebra on linguistic truth value domain (AX), in an attempt to propose a general resolution for linguistic many-valued logic based on hedge moving rules and linguistic lukasiewicz algebra for linguistic reasoning. Its theo...
متن کاملSemantic Minimization of 3-Valued Propositional Formulae
Abstract This paper presents an algorithm for a non-standard logicminimization problem that arises in -valued propositional logic. The problem is motivated by the potential for obtaining better answers in applications that use -valued logic. An answer of or provides precise (definite) information; an answer of provides imprecise (indefinite) information. By replacing a formula with a “better” f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computational Intelligence Systems
سال: 2013
ISSN: 1875-6891,1875-6883
DOI: 10.1080/18756891.2013.857895